Two Due-Date Assignment Scheduling with Location-Dependent Weights and a Deteriorating Maintenance Activity

This paper investigates single-machine scheduling with a deteriorating maintenance activity, where the processing time of job depends on whether it is handled before or after activity. Under common and slack due date assignments, aim to find optimal schedule, position value (flow-allowance) so that linear weighted sum earliness, tardiness minimized, weights are location-dependent (position-dependent) weights. Through series properties, polynomial algorithm proposed then proven problem polynomially solvable.